Optimising Graph Partitions Using Parallel Evolution
نویسندگان
چکیده
The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different parts is minimised. Although different algorithms to solve this problem have been proposed in complex graphs, it is unknown how good the partitions are since the problem is, in general, NP-complete. In this paper we present a new parallel evolutionary algorithm for graph partitioning where different heuristics, such Simulated Annealing, Tabu Search, and some Selection Mechanisms are mixed. The efficiency of the new algorithm is compared with other previously proposed algorithms with promising results.
منابع مشابه
A Parallelisable Algorithm for Optimising UnstructuredMesh Partitions
A newmethod is described for optimising graph partitions which arise in mapping unstructuredmesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance the workload and minimise the number and volume of interprocessor communications. It is designed to work efficiently in parallel as well as sequentially and can be applied directly to ...
متن کاملParallel Partitioning of Unstructured Meshes
A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance theworkload andminimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast dir...
متن کامل76 Parallel Unstructured Mesh
The use of unstructured mesh codes on parallel machines can be one of the most e cient ways to solve large Computational Fluid Dynamics (CFD) and Computational Mechanics (CM) problems. Completely general geometries and complex behaviour can readily be modelled and, in principle, the inherent sparsity of many such problems can be exploited to obtain excellent parallel e ciencies. An important co...
متن کاملSerial and Parallel Multilevel Graph Partitioning Using Fixed Centers
We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کامل